Every paracompact $C^m$-manifold modelled on the infinite countable product of lines is $C^m$-stable

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ROTATIONAL ASSIGNMENT OF NEW BANDS IN THE NO , EXCITATION SPECTRUM IN THE SPECTRAL RANGE OF 15600 cm TO 15633 cm

Sub-Doppler excitation spectroscopy in a collimated cold supersonic beam of 5% NO seeded in argon has been performed with a spectral resolution down to 10 MHz for four vibronic bands within the perturbed B ?X A system of NO . The rotational temperature of about 15 K achieved by adiabatic cooling allows the separation of closely lying vibronic bands which overlap in absorption spectra ...

متن کامل

Reducts of stable, CM-trivial theories

We show that every reduct of a stable, CM-trivial theory of finite Lascar rank is CM-trivial. AMS classification: 03C45

متن کامل

Fields on Paracompact Manifold and Anomalies

Abstract In Continuum Light Cone Quantization (CLCQ) the treatment of scalar fields as operator valued distributions and properties of the accompanying test functions are recalled. Due to the paracompactness property of the Euclidean manifold these test functions appear as decomposition of unity. The approach is extended to QED Dirac fields in a gauge invariant way. With such test functions the...

متن کامل

Petal Width, Cm Petal Width, Cm

There are several reasons why this book might be of interest to a TEX user. First, LTEX has a prominent place in the book. Second, the book describes a very interesting offshoot of literate programming, a topic traditionally popular in the TEX community. Third, since a number of TEX users work with data analysis and statistics, R could be a useful tool for them. Since some TUGboat readers are l...

متن کامل

2 Overview of the CM - 2 and CM - 5 Computers

This paper presents a preliminary experimental study of the performance of basic sparse matrix computations on the CM-200 and the CM-5. We concentrate on examining various ways of performing general sparse matrix-vector operations and the basic primitives on which these are based. We compare various data structures for storing sparse matrices and their corresponding matrix – vector operations. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1973

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-28-1-57-67